Finding Adam in random growing trees S´ebastien Bubeck ∗ Luc Devroye

Source URL: www.princeton.edu

• Tree
• Graph coloring
• NP-complete problems
• Euclidean algorithm
• Graph theory
• Mathematics
• Theoretical computer science

A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, and Marco Maratea MRG-DIST, University of Genova viale Francesco Causa, 13

Source URL: www.satisfiability.org

• Constraint programming
• Model theory
• Automated theorem proving
• Logic in computer science
• NP-complete problems
• Boolean satisfiability problem
• Constraint satisfaction
• Satisfiability
• Interpretation
• Theoretical computer science
• Mathematical logic
• Mathematics

Debye-Hückel Theory 1. assume complete dissociation of strong electrolytes 2. ionic atmosphere decreases chemical potential (have to do more work to pull ion out of solution)

Source URL: www.colby.edu

CS 330 – Spring 2013, Assignment 6 Problems due in the drop-box by 5PM, Thursday, April 18th (Monday schedule that day) Late assignments will only be accepted up until 5PM on Friday, April 19th Question[removed]pts). Cha

Source URL: www.cs.bu.edu

• Applied mathematics
• NP-complete
• NP
• P
• P versus NP problem
• NP-hard
• Theoretical computer science
• Computational complexity theory
• Complexity classes

Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science,

Source URL: www.cse.unsw.edu.au

• NP-complete problems
• Combinatorics
• Mathematical optimization
• Partition problem
• Heuristics
• Graph theory
• Heuristic function
• Bin packing problem
• Travelling salesman problem
• Mathematics
• Theoretical computer science
• Computational complexity theory

Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345

Source URL: www.cse.unsw.edu.au

• Automated theorem proving
• Boolean algebra
• NP-complete problems
• Constraint programming
• Logic in computer science
• Boolean satisfiability problem
• Davis–Putnam algorithm
• Satisfiability
• Unit propagation
• Theoretical computer science
• Mathematics
• Computational complexity theory

Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems

Source URL: www.jair.org

• NP-complete problems
• Discrete geometry
• Operations research
• Combinatorial optimization
• Bin packing problem
• Generalized assignment problem
• Knapsack problem
• Packing problem
• Strongly NP-complete
• Theoretical computer science
• Computational complexity theory
• Mathematics

Fast Construction of the Vietoris-Rips Complex Afra Zomorodian∗ (To appear in Computer & Graphics) 100

Source URL: www.cs.dartmouth.edu

• Graph operations
• Topology
• NP-complete problems
• Clique
• Vietoris–Rips complex
• Line graph
• Cograph
• Triangulation
• Graph
• Graph theory
• Mathematics
• Algebraic topology

On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas ˇ ˇ Ondˇrej Cepek and Stefan

Source URL: www.cs.uic.edu

• Logic in computer science
• Boolean algebra
• Complexity classes
• NP-complete problems
• Conjunctive normal form
• Computational problems
• 2-satisfiability
• Boolean satisfiability problem
• Disjunctive normal form
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

The Chaos Within Sudoku M´ aria Ercsey-Ravasz1, ∗ and Zolt´an Toroczkai2, 3, † arXiv:1208.0370v1 [nlin.CD] 1 Aug 2012

Source URL: arxiv.org

• NP-complete problems
• Logic puzzles
• Recreational mathematics
• Constraint programming
• Logic in computer science
• 2-satisfiability
• Sudoku
• Constraint satisfaction
• Boolean satisfiability problem
• Theoretical computer science
• Mathematics
• Computational complexity theory